Shift-invert Lanczos method for the symmetric positive semidefinite Toeplitz matrix exponential
نویسندگان
چکیده
The Lanczos method with shift-invert technique is exploited to approximate the symmetric positive semidefinite Toeplitz matrix exponential. The complexity is lowered by the Gohberg-Semencul formula and the fast Fourier transform. Application to the numerical solution of an integral equation is studied. Numerical experiments are carried out to demonstrate the effectiveness of the proposed method. Copyright c © 2010 John Wiley & Sons, Ltd.
منابع مشابه
Preconditioned Lanczos Methods for the Minimum Eigenvalue of a Symmetric Positive Definite Toeplitz Matrix
In this paper, we apply the preconditioned Lanczos (PL) method to compute the minimum eigenvalue of a symmetric positive definite Toeplitz matrix. The sine transform-based preconditioner is used to speed up the convergence rate of the PL method. The resulting method involves only Toeplitz and sine transform matrix-vector multiplications and hence can be computed efficiently by fast transform al...
متن کاملShift-invert Arnoldi Approximation to the Toeplitz
The shift-invert Arnoldi method is employed to generate an orthonormal basis from the Krylov subspace corresponding to a real Toeplitz matrix and an initial vector. The vectors and recurrence coefficients produced by this method are exploited to approximate the Toeplitz matrix exponential. Toeplitz matrix inversion formula and rapid Toeplitz matrix-vector multiplications are utilized to lower t...
متن کاملFast numerical solution for fractional diffusion equations by exponential quadrature rule
After spatial discretization to the fractional diffusion equation by the shifted Grünwald formula, it leads to a system of ordinary differential equations, where the resulting coefficient matrix possesses the Toeplitz-like structure. An exponential quadrature rule is employed to solve such a system of ordinary differential equations. The convergence by the proposed method is theoretically studi...
متن کاملError Bounds for the Lanczos Methods for Approximating Matrix Exponentials
In this paper, we present new error bounds for the Lanczos method and the shift-andinvert Lanczos method for computing e−τAv for a large sparse symmetric positive semidefinite matrix A. Compared with the existing error analysis for these methods, our bounds relate the convergence to the condition numbers of the matrix that generates the Krylov subspace. In particular, we show that the Lanczos m...
متن کاملFast exponential time integration scheme for option pricing with jumps
A fast exponential time integration scheme is considered for pricing European and double barrier options in jump-diffusion models. After spatial discretization, the option pricing problem is transformed into the product of a matrix exponential and a vector, while the matrix bears a Toeplitz structure. The shift-and-invert Arnoldi method is then employed for fast approximations to such operation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Numerical Lin. Alg. with Applic.
دوره 18 شماره
صفحات -
تاریخ انتشار 2011